Stochastic Economic Balance Principles for Project Planning: Feeding Buffers, Crashing, and Sequencing

نویسنده

  • Dan Trietsch
چکیده

A feeding buffer is created by starting a project activity before its latest start time to provide adequate protection against project delay. Assuming linear costs for starting activities earlier and a linear project delay penalty, early optimization models for project buffers addressed simple project network structures and invoked the newsvendor model as an approximation. Recently, it had been shown that when the gating activities precede the only stochastic elements in a project, then there exists an exact generalization of the newsvendor model that characterizes the optimal feeding buffers. This insight led to an effective and efficient solution approach by simulation. We show that this result also holds when stochastic elements exist elsewhere within the project. Therefore, the same simulation approach applies. This yields practically optimal feeding buffers even when it is impossible to compute the completion time distribution. The same insights can be used for sequencing decisions and, with a slight enhancement, for optimal crashing decisions. The method works even when activities are statistically dependent.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Crashing and Buffering of Stochastic Serial Projects

Crashing stochastic activities implies changing their distributions to reduce the mean. This can involve changing the variance too. Therefore, crashing can change not only the expected duration of a project but also the necessary size of its safety buffer. We consider optimal crashing of serial projects where the objective is to minimize total costs including crashing cost and expected delay pe...

متن کامل

Uncertain Resource Availabilities: Proactive and Reactive Procedures for Preemptive Resource Constrained project Scheduling Problem

Project scheduling is the part of project management that deals with determining when intime to start (and finish) which activities and with the allocation of scarce resources to theproject activities. In practice, virtually all project managers are confronted with resourcescarceness. In such cases, the Resource-Constrained Project Scheduling Problem (RCPSP)arises. This optimization problem has...

متن کامل

Pert 21

More than half a century after the debut of CPM and PERT, we still lack a project scheduling system with calibrated and validated distributions and without requiring complex user input. Modern decision support systems (DSS) for project management are more sophisticated and comprehensive than PERT/CPM. Nonetheless, in terms of stochastic analysis, they show insufficient progress. PERT 21 offers ...

متن کامل

A New Multi-objective Model for Multi-mode Project Planning with Risk

The purpose of this problem is to choose a set of project activities for crashing, in a way that the expected project time, cost and risk are minimized and the expected quality is maximized. In this problem, each project activity can be performed with a specific executive mode. Each executive mode is characterized with four measures, namely the expected time, cost, quality and risk. In this pap...

متن کامل

A Fuzzy Simulated Annealing approach for project time-cost tradeoff

Managers often face difficulties when making project decisions that involve large number of interrelated activities – the planning and scheduling of which is project management. Most problems often arise in areas such as product development, production planning and control and setting up the production facilities. One important aspect of project management is activity crashing, i.e. reducing th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004